基于约束处理和平滑技术的改进的进化算法

doi:10.3969/j.issn.10062475.2014.09.001

计算机与现代化

• 数据库与数据挖掘 • 下一篇

基于约束处理和平滑技术的改进的进化算法

1.西安文理学院软件学院,陕西西安710068；2.西安电子科技大学计算机学院,陕西西安710071

收稿日期:2014-02-24 出版日期:2014-10-10 发布日期:2014-11-04
作者简介:王晓萍(1962)，女，辽宁抚顺人，西安文理学院软件学院高级工程师，硕士，研究方向：网格计算，云计算，计算智能；孟坤(1989)，男，河南新乡人，西安电子科技大学计算机学院硕士研究生，研究方向：网格计算，任务调度以及进化算法应用。
基金资助:
西安市科技计划创新基金文理专项资助项目（CXY1352WL07）

An Improved Genetic Algorithm Based on Constraint Handling and Smoothing Techniques

1. Software Institute, Xi’an University of Arts and Science, Xi’an 710068, China； 
2. School of Computer Science and Technology, Xidian University, Xi’an 710071, China

Received:2014-02-24 Online:2014-10-10 Published:2014-11-04

摘要/Abstract

摘要： 进化算法是解决复杂非线性规划的一种有效方法，然而其计算量通常比较大，约束较难处理。本文首先利用约束处理技术将约束最优化问题转化为无约束最优化问题以降低问题求解难度。其次，为了减少局部最优解的个数，利用了平滑技术，该技术可以消除不优于当前最优解的全部局部最优解。此外，设计新的交叉算子。基于此，本文提出一种改进的进化算法，实验结果表明该算法具有较低的计算量和更快的收敛速度。

关键词: 约束处理, 平滑技术, 进化算法, 进化算子, 全局优化

Abstract: Evolutionary algorithm is a new kind of efficient methods for complex nonlinear programming, however, the amount of their computation is usually very large, and the constraints can not be handled efficiently. In this paper, firstly, the constrained problem is transformed into an unconstrained one so as to reduce the difficulty of problem solving. Secondly, to reduce the number of local optimal solutions, a smoothing technique is adopted. It can eliminate all local optimal solutions which are not better than the current best solution found so far, and keep all the local optimal solutions which is better than the current best solution. Furthermore, a new crossover operator is designed. Based on all these, an improved evolutionary algorithm is proposed and experimental results show the efficiency of the proposed algorithm with less computation, higher convergent speed for all test problems.

Key words: constraint handling, smoothing techniques, evolutionary algorithm, evolutionary operators, global optimization

中图分类号:

中图分类号： TP301.6

王晓萍1，孟坤2. 基于约束处理和平滑技术的改进的进化算法[J]. 计算机与现代化, doi: 10.3969/j.issn.10062475.2014.09.001 .

WANG Xiaoping1, MENG Kun2. An Improved Genetic Algorithm Based on Constraint Handling and Smoothing Techniques[J]. Computer and Modernization, doi: 10.3969/j.issn.10062475.2014.09.001 .

参考文献

［1］
Michalewicz Z. Genetic Algorithms+Data Structures=Evolution Programs［M］. 3rd Edition. Berlin: SpringerVerlag, 1999.
［2］ Tahk Minjea, Sun Byungchan. Coevolutionary augmented Lagrangian methods for constrained optimization［J］. IEEE Trans. on Evolutionary Computation, 2000,4(1):114124. 
［3］ Kim J H, Myung H. Evolutionary programming techniques for constrained optimization［J］. IEEE Trans. on Evolutionary Computation, 1997,1(1):129140.
［4］ Deb K, Agrawal S. A nichedpenalty approach for constrained handling in genetic algorithms［C］// Proceedings of the ICANNGA. 1999:235243.
［5］ Yao Xin, Liu Yong. Fast evolution strategies［M］// Evolutionary Programming VI. Berlin: SpringerVerlag, 1997:149161. 
［6］ Back T, Schwefel H P. An overview of evolutionary algorithms for parameter optimization［J］. Evolutionary Computation, 1993,1(1):123.
［7］左利云，曹志波，董守斌. 云计算虚拟资源的熵优化和动态加权评估模型［J］. 软件学报， 2013，24（8）:19371946.
［8］王宇平,刘大莲. 基于平滑技术和一维搜索的全局优化进化算法及其收敛性［J］. 计算机学报, 2006,29(4):670675.
［9］ Wang Yuping, Dang Chuangyin. An evolutionary algorithm for global optimization based on levelset evolution and Latin squares［J］. IEEE Trans. on Evolutionary Computation, 2007,11(5):579595.
［10］Leung Y W, Wang Yuping. An orthogonal genetic algorithm with quantization for global numerical optimization［J］. IEEE Trans. on Evolutionary Computation, 2001,5(1):4153.
［11］Chew Soo Hong, Zheng Quan. Integral Global Optimization: Theory, Implementation and Applications［M］. Berlin Heidelberg: SpringerVerlag, 1988.
［12］ Deb K, Agrawal R. Simulated binary crossover for continuous search space［J］. Complex Systems, 1995,9(2):115148. 
［13］Powell D, Skolnick M M. Using genetic algorithms in engineering design optimization with nonlinear constraints［C］//Proc. of the Fifth International Conference on Genetic Algorithms. 1993:424430.
［14］ Carlos A Clello Coello. Constrainthandling using an evolutionary multiobjective optimization technique［J］. Civil Engineering and Environmental Systems, 2000,17(4):319346. 
［15］ Deb K. A robust optimal design technique for mechanical component design［M］// Evolutionary Algorithms in Engineering Applications. Berlin: SpringerVerlag. 1997:497514. 
［16］Homaifar A, Chlarelene X Qi, Steven H Lai. Constrained optimization via genetic algorithms［J］. Simulation, 1994,62(4):242253.
［17］Gen M, Chang R. Genetic Algorithms & Engineering Design［M］. New York :John Wiley & Sons Inc., 1997.

[1]	鄂翔南1，刘泽平2，张子晔3. 基于差分进化算法的面目标瞄准点寻优[J]. 计算机与现代化, 2019, 0(12): 27-.
[2]	陈泯融，黄广敬. 基于分解的多目标花朵授粉算法[J]. 计算机与现代化, 2019, 0(07): 1-.
[3]	何荣义1,李春光2. RoboCup3D仿真机器人步态优化研究[J]. 计算机与现代化, 2018, 0(03): 20-.
[4]	张春燕. 改进多目标进化算法求解柔性作业车间调度问题[J]. 计算机与现代化, 2017, 0(9): 79-84.
[5]	杨争光1,2,范良忠2. 基于MEC-BP神经网络在水产养殖水质预测中的应用[J]. 计算机与现代化, 2015, 0(6): 32-36.
[6]	姜凯，苑金海. 融合差分进化和SOM的组合文本聚类算法[J]. 计算机与现代化, 2015, 0(5): 13-16+20.
[7]	殷昭宁;孙靖. 三种基于偏好的区间多目标进化算法及应用[J]. 计算机与现代化, 2012, 1(11): 43-46.
[8]	丛婷婷;祝永志. 并行差分进化算法[J]. 计算机与现代化, 2011, 1(1): 49-3.

基于约束处理和平滑技术的改进的进化算法

An Improved Genetic Algorithm Based on Constraint Handling and Smoothing Techniques

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 8

编辑推荐

Metrics

本文评价